A New Class of RC4 Colliding Key Pairs with Greater Hamming Distance
نویسندگان
چکیده
In this paper, we discovered a new class of colliding key pairs of RC4, namely, two different secret keys generate the same internal state after RC4’s key scheduling algorithm. This is to our knowledge the first discovery of RC4 colliding keys with hamming distance greater than one, that is, the colliding key pairs we found can differ from each other at three different positions, and the value difference between these positions needs not be fixed. We analyzed the transition pattern and evaluated the probability of the existence of this new class of colliding key pairs. Our result shows that RC4 key collision could be achieved by two keys with greater hamming distance than the ones found in [1] and [2]. And this newly discovered class of colliding key pairs reveals the weakness that RC4’s key scheduling algorithm could generate even more colliding keys. We also proposed an algorithm for searching colliding key pairs within this new class. Some concrete colliding key pairs are demonstrated in this paper, among which 55-byte colliding key pair is the shortest one we found by using our algorithm within one hour time.
منابع مشابه
Generalized RC4 Key Collisions and Hash Collisions
In this paper, we discovered that RC4 can generate colliding key pairs with various hamming distances, other than those found by Matsui (with hamming distance one), and by Chen and Miyaji (with hamming distance three). We formalized RC4 colliding key pairs into two large patterns, namely, Transitional pattern and Self-Absorbing pattern, according to the behavior during KSA. The colliding key pa...
متن کاملHow to Find Short RC4 Colliding Key Pairs
The property that the stream cipher RC4 can generate the same keystream outputs under two different secret keys has been discovered recently. The principle that how the two different keys can achieve a collision is well known by investigating the key scheduling algorithm of RC4. However, how to find those colliding key pairs is a different story, which has been largely remained unexploited. Pre...
متن کاملKey Collisions of the RC4 Stream Cipher
This paper studies “colliding keys” of RC4 that create the same initial state and hence generate the same pseudo-random byte stream. It is easy to see that RC4 has colliding keys when its key size is very large, but it was unknown whether such key collisions exist for shorter key sizes. We present a new state transition sequence of the key scheduling algorithm for a related key pair of an arbit...
متن کاملThe Iby and Aladar Fleischman Faculty of Engineering The Zandman -
We present an estimation of the closeness level between the distribution of RC4 keystream bytes (at some predefined locations in the stream) to a uniform distribution (over the same domain). Our estimation is based on the L1 distance between a pair of distributions over the same domain. Although learning the distance (empirically) between a distribution of a pair of consecutive bytes in the str...
متن کاملNear Collisions in the RC4 Stream Cipher
In this paper we explore the intriguing factors involved in the non oneone nature of the RC4, and explore new techniques and present interesting findings regarding the same. The first part of this paper studies near colliding keys of the RC4, and discusses how these keys are localized into clusters in the key-space. The second part of this paper proposes a new collision search algorithm specifi...
متن کامل